價格：免費
更新日期：2015-09-24
檔案大小：20M
目前版本：0.7.4
版本需求：Android 2.3 以上版本
官方網站：mailto:viola.hirtipes@gmail.com
Email：http://tsuwabuki.hatenablog.com/entry/2015/05/18/184219
聯絡地址：東京都港区赤坂7-5-34
Puzzles commonly ask for tiling a given region with a given set of polyominoes, such as the 12 pentominoes. Golomb's and Gardner's books have many examples. A typical puzzle is to tile a 6×10 rectangle with the twelve pentominoes; the 2339 solutions to this were found in 1960. Where multiple copies of the polyominoes in the set are allowed, Golomb defines a hierarchy of different regions that a set may be able to tile, such as rectangles, strips, and the whole plane, and shows that whether polyominoes from a given set can tile the plane is undecidable, by mapping sets of Wang tiles to sets of polyominoes.
